Cluster Identification Algorithms for Spin Models - Sequential and Parallel
نویسندگان
چکیده
Monte Carlo cluster update algorithms are extremely eecient for simulating spin models near their phase transitions, where local update algorithms suuer severe critical slowing down. Unfortunately, as the cluster algorithms are highly irregular as well as non-local, they are much more diicult to parallelize eeciently. The main diiculty lies in identifying which spins belong to which cluster. In this paper we investigate a number of cluster identiication algorithms, both sequential and parallel, which we have implemented on serial, SIMD and MIMD computers.
منابع مشابه
Cluster Algorithms for Spin Models on MIMD Parallel Computers
Parallel computers are ideally suited to the Monte Carlo simulation of spin models using the standard Metropolis algorithm, since it is regular and local. However local algorithms have the major drawback that near a phase transition the number of sweeps needed to generate a statistically independent configuration increases as the square of the lattice size. New algorithms have recently been dev...
متن کاملParallel Cluster Identification for Multidimensional Lattices
The cluster identification problem is a variant of connected component labeling that arises in cluster algorithms for spin models in statistical physics. We present a multidimensional version of Belkhale and Banerjee’s Quad algorithm for connected component labeling on distributed memory parallel computers. Our extension abstracts away extraneous spatial connectivity information in more than tw...
متن کاملDoes Fundraising Have Meaningful Sequential Patterns? The Case of Fintech Startups
Nowadays, fundraising is one of the most important issues for both Fintech investors and startups. The pattern of fundraising in terms of “number and type of rounds and stages needed” are important. The diverse features and factors that could stem from Fintech business models which can influence success are of the key issues in shaping these patterns. This study applied the top 100 KPMG Fintech...
متن کاملMonte Carlo Methods in Sequential and Parallel Computing of 2d and 3d Ising Model
Because of its complexity, the 3D Ising model has not been given an exact analytic solution so far, as well as the 2D Ising in non zero external field conditions. In real materials the phase transition creates a discontinuity. We analysed the Ising model that presents similar discontinuities. We use Monte Carlo methods with a single spin change or a spin cluster change to calculate macroscopic ...
متن کاملParallel Cluster Algorithms
Cluster update algorithms dramatically reduce critical slowing down in spin models , but unlike the standard Metropolis algorithm, it is not obvious how to implement these algorithms efficiently on parallel or vector computers. Here we present two different parallel implementations of the Swendsen-Wang algorithm which give reasonable efficiencies on various MIMD parallel computers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Concurrency - Practice and Experience
دوره 3 شماره
صفحات -
تاریخ انتشار 1991